Which linear compartmental systems contain traps?
نویسندگان
چکیده
منابع مشابه
Linear Compartmental Systems-The Basics
0.1 The Model Consider material flowing among n compartments labeled 1, 2, · · · , n. Assume to begin that no material flows into any compartment from the external environment but that material can flow out of a compartment to the external environment and be lost. Material may flow between compartments. In Pharmacokinetics, the material is a drug, administered to the body, say orally, and the c...
متن کاملStructural identifiability of linear mamillary compartmental systems
In biology and mathematics compartmental systems are frequently used. System identiica-tion of systems based on physical laws often involves parameter estimation. Before parameter estimation can take place, we have to examine whether the parameters are structurally iden-tiiable. In this paper we propose a test for the structural identiiability of linear mamillary compartmental systems. The meth...
متن کاملWhich linear compartmental systems can be analyzed by spectral analysis of PET output data summed over all compartments?
General linear time-invariant compartmental systems were examined to determine which systems meet the conditions necessary for application of the spectral analysis technique to the sum of the concentrations in all compartments. Spectral analysis can be used to characterize the reversible and irreversible components of the system and to estimate the minimum number of compartments, but it applies...
متن کاملPositive and compartmental systems
When dealing with compartmental systems, an important question is: given an experiment, i.e., an input–output sequence, and supposing there is no error in the data, is the sequence compatible with the compartmental assumption? If the process under analysis is linear, then the previous question is obviously equivalent to asking whether a given transfer function is that of a compartmental system....
متن کاملOn graphs which contain all small trees
Communicated by the Managing Editors We investigate those graphs G, with the property that any tree on N vertices occurs as subgraph of G,. In particular, we consider the problem of estimating the minimum number of edges such a graph can have. We show that this number is bounded below and above by $z log II and nl+l/log log %, respectively. A typical question in extremal graph theory1 is one wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Biosciences
سال: 1972
ISSN: 0025-5564
DOI: 10.1016/0025-5564(72)90082-x